Research on a Rumor Transmission Model with Refutation Mechanism
نویسندگان
چکیده
منابع مشابه
A Rumor Spreading Model with Control Mechanism on Social Networks
In this paper, considering a control mechanism that uses an anti-rumor spread to combat a rumor spread, a novel susceptible-infected (SI) model is developed. By means of mean-field theory, the early stage propagation dynamics of the rumor and the anti-rumor on homogeneous networks and inhomogeneous networks are investigated, respectively. Theoretical analysis and simulation results show that, i...
متن کاملRumor Spreading of a SICS Model on Complex Social Networks with Counter Mechanism
The rumor spreading has been widely studied by scholars. However, there exist some people who will persuade infected individuals to resist and counterattack the rumor propagation in our social life. In this paper, a new SICS (susceptible-infected-counter-susceptible) rumor spreading model with counter mechanism on complex social networks is presented. Using the mean-field theory the spreading d...
متن کاملTrust and Organizational Rumor Transmission
For 9 hours on a hot Sunday afternoon in Sydney, Australia, police in riot gear battled 200 Aboriginal youths (Chulov, Warne-Smith, & Colman, 2004). Bricks, bottles, and firecrackers rained down on the police, 40 of whom were injured during the melee. The spark that ignited this tinderbox was a rumor that police cars had chased 17-year-old Thomas Hickey on his bicycle, causing him to fall and f...
متن کاملDynamical Model about Rumor Spreading with Medium
Rumor is a kind of social remark, that is untrue, and not be confirmed, and spreads on a large scale in a short time. Usually, it can induce a cloud of pressure, anxiety, and panic. Traditionally, it is propagated by word of mouth. Nowadays, with the emergence of the internet, rumors can be spread by instant messengers, emails, or publishing. With this new pattern of spreading, an ISRW dynamica...
متن کاملOn Learning versus Refutation
Building on the work of Daniely et al. (STOC 2014, COLT 2016), we study the connection between computationally efficient PAC learning and refutation of constraint satisfaction problems. Specifically, we prove that for every concept class P, PAC-learning P is polynomially equivalent to “random-right-hand-side-refuting” (“RRHS-refuting”) a dual class P∗, where RRHS-refutation of a class Q refers ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2018
ISSN: 2475-8841
DOI: 10.12783/dtcse/wcne2017/19826